Complete intersection Jordan types in height two
نویسندگان
چکیده
منابع مشابه
Retractions in Intersection Types
This paper deals with retraction intended as isomorphic embedding in intersection types building left and right inverses as terms of a λ-calculus with a ⊥ constant. The main result is a necessary and sufficient condition two strict intersection types must satisfy in order to assure the existence of two terms showing the first type to be a retract of the second one. Moreover, the characterisatio...
متن کاملThe Leading Ideal of a Complete Intersection of Height Two in a 2-dimensional Regular Local Ring
Let (S,n) be a 2-dimensional regular local ring and let I = (f, g) be an ideal in S generated by a regular sequence f, g of length two. Let I∗ be the leading ideal of I in the associated graded ring grn(S), and set R = S/I and m = n/I. In [GHK2], we prove that if μG(I ∗) = n, then I∗ contains a homogeneous system {ξi}1≤i≤n of generators such that deg ξi + 2 ≤ deg ξi+1 for 2 ≤ i ≤ n−1, and htG(ξ...
متن کاملSession Types = Intersection Types + Union Types
We propose a semantically grounded theory of session types which relies on intersection and union types. We argue that intersection and union types are natural candidates for modeling branching points in session types and we show that the resulting theory overcomes some important defects of related behavioral theories. In particular, intersections and unions provide a native solution to the pro...
متن کاملThe Inhabitation Problem for Rank Two Intersection Types
We prove that the inhabitation problem for rank two intersection types is decidable, but (contrary to common belief) EXPTIME-hard. The exponential time hardness is shown by reduction from the in-place acceptance problem for alternating Turing machines.
متن کاملTwo-Level Game Semantics, Intersection Types, and Recursion Schemes
We introduce a new cartesian closed category of two-level arenas and innocent strategies to model intersection types that are refinements of simple types. Intuitively a property (respectively computation) on the upper level refines that on the lower level. We prove Subject Expansion—any lower-level computation is closely and canonically tracked by the upper-level computation that lies over it—w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2020
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2020.04.015